/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
//贡献度ans
const ll maxn = 1e5;
ll a[maxn], n;
ll ans[maxn];

int main()
{
    IOS;
    cin >> n;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    ll max1 = 0, max2 = 0;
    for (ll i = 1; i <= n; i++)
    {
        if (a[i] > max1)
        {
            ans[a[i]]--;
            max2 = max1;
            max1 = a[i];
        }
        else if (a[i] > max2)
        {
            ans[max1]++;
            max2 = a[i];
        }
    }
    ll maxans = -maxn, ans_s = maxn + 1;
    for (ll i = 1; i <= n; i++)
    {
        if (ans[i] > maxans)
        {
            maxans = ans[i];
            ans_s = i;
        }
    }
    cout << ans_s << endl;
    getchar();
    getchar();
    return 0;
}
